Euclidean Distance Degree and Mixed Volume
نویسندگان
چکیده
Abstract We initiate a study of the Euclidean distance degree in context sparse polynomials. Specifically, we consider hypersurface $$f=0$$ f = 0 defined by polynomial f that is general given its support, such support contains origin. show equals mixed volume Newton polytopes associated Lagrange multiplier equations. discuss implication our result for computational complexity and give formula when polytope rectangular parallelepiped.
منابع مشابه
Euclidean Distance Degree for Chemical Reaction Networks
In this paper we investigate the complexity of model selection and model testing in chemical reaction networks by formulating them as Euclidean distance problems. We determine closed form expressions for the Euclidean distance degree of the steady state varieties associated to several different families of toric chemical reaction networks with arbitrarily many reaction sites. We show how our re...
متن کاملMixed volume and distance geometry techniques for counting Euclidean embeddings of rigid graphs
A graph G is called generically minimally rigid in R if, for any choice of sufficiently generic edge lengths, it can be embedded in R in a finite number of distinct ways, modulo rigid transformations. Here, we deal with the problem of determining tight bounds on the number of such embeddings, as a function of the number of vertices. The study of rigid graphs is motivated by numerous application...
متن کاملThe Euclidean Distance Degree of Smooth Complex Projective Varieties
We obtain several formulas for the Euclidean distance degree (ED degree) of an arbitrary nonsingular variety in projective space: in terms of Chern and Segre classes, Milnor classes, Chern-Schwartz-MacPherson classes, and an extremely simple formula equating the Euclidean distance degree of X with the Euler characteristic of an open subset of X.
متن کاملThe Euclidean Distance Degree of an Algebraic Variety
The nearest point map of a real algebraic variety with respect to Euclidean distance is an algebraic function. For instance, for varieties of low rank matrices, the Eckart-Young Theorem states that this map is given by the singular value decomposition. This article develops a theory of such nearest point maps from the perspective of computational algebraic geometry. The Euclidean distance degre...
متن کاملThe Euclidean Distance Degree of Orthogonally Invariant Matrix Varieties
We show that the Euclidean distance degree of a real orthogonally invariant matrix variety equals the Euclidean distance degree of its restriction to diagonal matrices. We illustrate how this result can greatly simplify calculations in concrete circumstances.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Foundations of Computational Mathematics
سال: 2021
ISSN: ['1615-3383', '1615-3375']
DOI: https://doi.org/10.1007/s10208-021-09534-8